Trees with Large Maximal Independent Sets
نویسندگان
چکیده
In this paper, we determine the fourth and fifth largest number of maximal independent sets in trees. Also, the extremal trees achieving these value are determined. Mathematics Subject Classification: 05C35, 05C69, 68R10
منابع مشابه
Sharp bounds for the number of maximal independent sets in trees of fixed diameter
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.
متن کاملMaximal Independent Sets without Including any Leaves in Trees
In this paper we study maximal independent sets in trees without including any leaves. In particular, we determine some small and the largest number of these sets in trees. Extremal trees achieving these values are determined too. Mathematics Subject Classification: 05C35, 05C69, 68R10
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملTrees with two disjoint minimum independent dominating sets
The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maximal independent set of G. A maximal independent set of cardinality i(G) in G we call an i(G)-set. In this paper we provide a constructive characterization of trees G that have two disjoint i(G)-sets. © 2005 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010